//Wed Jul 28 13:48:06 CDT 2010
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class VacationTime
{
public:
	int bestSchedule(int N, int K, vector<int> workingDays)
	{
		int ret = N;
		for (int i = 1; i + K - 1 <= N; i++)
		{
			vector<bool> v(N + 1, true);
			int count = 0;
			for (int j = 0; j < workingDays.size(); j++)
			{
				if (workingDays[j] >= i && workingDays[j] <= i + K - 1)
					count++;
			}
			ret = min(ret, count);
		}
		return ret;
	}
};
//It just try every situation and to check if it satisfied with any one.
